Improve the 3-flip Neighborhood Local Search by Random Flat Move for the Set Covering Problem
نویسندگان
چکیده
The 3-flip neighborhood local search (3FNLS) is an excellent heuristic algorithm for the set covering problem which has dominating performance on the most challenging crew scheduling instances from Italy railways. We introduce a method to further improve the effectiveness of 3FNLS by incorporating random flat move to its search process. Empirical studies show that this can obviously improve the solution qualities of 3FNLS on the benchmark instances. Moreover, it updates two best known solutions within reasonable time.
منابع مشابه
A 3-flip neighborhood local search for the set covering problem
The set covering problem (SCP) asks to choose a minimum cost family of subsets from given n subsets, which together covers the entire ground set. In this paper, we propose a local search algorithm for SCP, which have the following three features. (1) The use of 3ip neighborhood, which is the set of solutions obtainable from the current solution by exchanging at most three subsets. As the size o...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملSolving the flexible job shop problem by hybrid metaheuristics-based multiagent model
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...
متن کاملA Heuristic Algorithm for the Set Multicover Problem with Generalized Upper Bound Constraints
We consider an extension of the set covering problem (SCP) introducing (i) multicover and (ii) generalized upper bound (GUB) constraints that arise in many real applications of SCP. For this problem, we develop a 2-flip neighborhood local search algorithm with a heuristic size reduction algorithm, in which a new evaluation scheme of variables is introduced taking account of GUB constraints. Acc...
متن کامل